Efficient Implementation of Binary Trees in LISP Systems
نویسندگان
چکیده
منابع مشابه
Efficient Implementation of Suffix Trees
We study the problem of string searching using the traditional approach of storing all unique substrings of the text in a suffix tree. The methods of path compression, level compression and data compression are combined to build a simple, compact and efficient implementation of a suffix tree. Based on a comparative discussion and extensive experiments, we argue that our new data structure is su...
متن کاملEfficient Use of Differentially Private Binary Trees
Binary trees can be made differentially private by adding noise to every node and leaf. In such form they allow multifaceted exploration of a variable without revealing any individual information. While a differentially private binary tree can be used and read just like its conventional exact-valued analog, realizing that different combinations of nodes contain overlapping answers to the same i...
متن کاملEfficient Implementation of Lazy Suffix Trees
We present an efficient implementation of a write-only topdown construction for suffix trees. Our implementation is based on a new, space-efficient representation of suffix trees which requires only 12 bytes per input character in the worst case, and 8.5 bytes per input character on average for a collection of files of different type. We show how to efficiently implement the lazy evaluation of ...
متن کاملAn Implementation of Lispkit Lisp in Java
Functional programming languages (FPL) and their implementations are still very interesting topics in the computer community. Declarative languages are also extremely interesing in the field of interagent communication. Thus it seems that a FPL could be a good starting point for the implementation of particular Agent Communication Languages. In this paper a description of a concrete LispKit LIS...
متن کاملAn Efficient Implementation of Implied Binomial Trees
Implied binomial trees are constructed by fitting a risk-neutral density (in the form of ending nodal probabilities) to observed option prices. Since there are usually not enough options traded in the marketplace, a quadratic program is often used to extract the ending nodal probabilities from observed option prices. A problem with this commonly used approach is that the quadratic program is us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.4.330